Supporting Information for the Paper: Quaternary Constant-Composition Codes with Weight Four and Distances Five or Six

نویسندگان

  • Mingzhi Zhu
  • Gennian Ge
چکیده

Proposition 1.1: There exists a [2, 1, 1]-GDC(5) of type 2 with size 2t(t − 1) for each t ∈ {9, 11}, which is also an optimal (2t, 5, [2, 1, 1])4-code. Proof: For each t ∈ {9, 11}, let Xt = Z2t, Gt = {{i, t+ i} : i ∈ Zt} and Ct be the set of cyclic (or quasi-cyclic) shifts of the vectors generated by the following vectors respectively. Then (Xt,Gt, Ct) is a [2, 1, 1]-GDC(5) of type 2 with size 2t(t− 1), where

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quaternary Constant-Composition Codes with Weight Four and Distances Five or Six

The sizes of optimal constant-composition codes of weight three have been determined by Chee, Ge and Ling with four cases in doubt. Group divisible codes played an important role in their constructions. In this paper, we study the problem of constructing optimal quaternary constant-composition codes with Hamming weight four and minimum distances five or six through group divisible codes and Roo...

متن کامل

Optimal ternary constant-composition codes with weight four and distance six

The sizes of optimal constant-composition codes of weight three have been determined by Chee, Ge and Ling with four cases in doubt. Group divisible codes played an important role in their constructions. In this paper, we study the problem of constructing optimal ternary constant-composition codes with Hamming weight four and minimum distance six. The problem is solved with a small number of len...

متن کامل

Lexicographic Constant-Weight Equidistant Codes over the Alphabet of Three, Four and Five Elements

In this paper we consider the problem of finding bounds on the size of lexicographic constant-weight equidistant codes over the alphabet of three, four and five elements with 2 ≤ w < n ≤ 10. Computer search of lexicographic constant-weight equidistant codes is performed. Tables with bounds on the size of lexicographic constant-weight equidistant codes are presented.

متن کامل

Constacyclic Codes over Group Ring (Zq[v])/G

Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...

متن کامل

Linear Size Optimal q-ary Constant-Weight Codes and Constant-Composition Codes

An optimal constant-composition or constant-weight code of weight has linear size if and only if its distance is at least . When , the determination of the exact size of such a constant-composition or constant-weight code is trivial, but the case of has been solved previously only for binary and ternary constant-composition and constant-weight codes, and for some sporadic instances. This paper ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012